Learning rotations
نویسندگان
چکیده
Many problems in computer vision today are solved via deep learning. Tasks like pose estimation from images, point clouds or structure motion can all be formulated as a regression on rotations. However, there is no unique way of parametrizing rotations mathematically: matrices, quaternions, axis-angle representation Euler angles commonly used the field. Some them, however, present intrinsic limitations, including discontinuities, gimbal lock antipodal symmetry. These limitations may make learning neural networks challenging problem, potentially introducing large errors. Following recent literature, we propose three case studies: sanity check, 3D and an inverse kinematic problem. We do so by employing full geometric algebra (GA) description compare GA formulation with 6D continuous previously presented literature terms error reconstruction accuracy. empirically demonstrate that bivectors outperforms representation. The approach overcomes continuity issue representations does, but it also needs fewer parameters to learned offers enhanced robustness noise. hence provides broader framework for describing simple compact suitable tasks learning, showing high accuracy good generalizability realistic high-noise scenarios.
منابع مشابه
Learning Rotations Learning rotations with little regret
We describe online algorithms for learning a rotation from pairs of unit vectors in R. We show that the expected regret of our online algorithm compared to the best fixed rotation chosen offline over T iterations is O( √ nT ). We also give a lower bound that proves that this expected regret bound is optimal within a constant factor. This resolves an open problem posed in COLT 2008. Our online a...
متن کاملLearning Rotations
Many different matrix classes have been tackled recently using online learning techniques, but at least one major class has been left out: rotations. We pose the online learning of rotations as an open problem and discuss the importance of this problem.
متن کاملOn Learning Rotations
An algorithm is presented for online learning of rotations. The proposed algorithm involves matrix exponentiated gradient updates and is motivated by the von Neumann divergence. The multiplicative updates are exponentiated skew-symmetric matrices which comprise the Lie algebra of the rotation group. The orthonormality and unit determinant of the matrix parameter are preserved using matrix logar...
متن کاملLearning Rotations Online
In this paper we show that the matrix von Mises-Fisher (vMF) distribution is a reasonable distribution upon which to build an online density estimation scheme for rotation matrices. We also consider a special case, the unit circle, for initial experimentation. The vector and matrix vMF distributions admit online algorithms in terms of their expectation parameters as a direct result of their exp...
متن کاملMinimax Algorithm for Learning Rotations
It is unknown what is the most suitable regularization for rotation matrices and how to maintain uncertainty over rotations in an online setting. We propose to address these questions by studying the minimax algorithm for rotations and begin by working out the 2-dimensional case. The problem of online learning of rotations is defined as follows. In every iteration t = 1, 2, . . . , T , the lear...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Methods in The Applied Sciences
سال: 2022
ISSN: ['1099-1476', '0170-4214']
DOI: https://doi.org/10.1002/mma.8698